SEAProgram Monday, June 29th 8:00 8:50 9:00

Source URL: sea2015.lip6.fr

• NP-complete problems
• Computational complexity theory
• Steiner tree problem
• Combinatorial optimization
• Shortest path problem
• Mathematical optimization
• Independent set
• Combinatorics
• Graph theory
• Book:Graph Theory

Endterm Computational Complexity Solve all 6 questions. The solutions are due by 9:00 pm on Monday, May 4. Some hints are given on page 3. All the best!

Source URL: ftp.cs.nyu.edu

Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one

Source URL: www2.informatik.hu-berlin.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Packing problems
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Polynomial-time approximation scheme
• Partition problem
• NP
• NC
• Time complexity

Why Computational Complexity Requires Stricter Martingales∗ John M. Hitchcock† Jack H. Lutz‡

Source URL: www.cs.uwyo.edu

Quantifying Network Topology Robustness Under Budget Constraints: General Model and Computational Complexity Aron Laszka1 and Assane Gueye2 1

Source URL: aronlaszka.com

Call for Papers Twenty-sixth Annual IEEE Conference on Computational Complexity June 8–10, 2011 San Jose, California

Source URL: facweb.cs.depaul.edu

Motivation Proper Brave Induction Computational Complexity

Source URL: www.ilp2015.jp

Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Dominating set
• Independent set
• Vertex cover
• Connected dominating set
• Set cover problem
• Line graph
• Metric k-center
• Domatic number

Solutions to Homework I CS6520 Computational Complexity February 15, 2005

Source URL: www.cs.nyu.edu

Electronic Colloquium on Computational Complexity, Report NoImproved Testing Algorithms for Monotonicity Yevgeniy Dodis Oded Goldreichy Eric Lehmanz Sofya Raskhodnikovax

Source URL: www.wisdom.weizmann.ac.il